Substructural Logics over Fl I: Algebraization, Parametrized Local Deduction Theorem and Interpolation
نویسنده
چکیده
Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation properties and explain how they imply the amalgamation property for certain varieties of residuated lattices.
منابع مشابه
Nikolaos Galatos
Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation pro...
متن کاملNonassociative Substructural Logics and their semilinear Extensions: Axiomatization and Completeness Properties
Substructural logics extending the full Lambek calculus FL have largely benefited from a systematical algebraic approach based on the study of their algebraic counterparts: residuated lattices. Recently, a non-associative generalization of FL (which we call SL) has been studied by Galatos and Ono as the logics of lattice-ordered residuated unital groupoids. This paper is based on an alternative...
متن کاملAlmost (MP)-based substructural logics
This paper is a contribution to the theory of substructural logics. We introduce the notions of (MP)-based and almost (MP)-based logics (w.r.t. a special set of formulae D), which leads to an alternative proof of the well-known forms of the local deduction theorems for prominent substructural logics (FL, FLe, FLew , etc.). Roughly speaking, we decompose the proof of the local deduction theorem ...
متن کاملProof Theory and Algebra in Substructural Logics
It is quite well understood that propositional logics are tightly connected to ordered algebras via algebraic completeness, and because of this connection proof theory is often useful in the algebraic context too. A prominent example is that one deductively proves the interpolation theorem for a given logic in order to derive the algebraic amalgamation property for the corresponding variety as ...
متن کاملHerbrand Theorems for Substructural Logics
Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand and Skolemization theorems therefore take various forms, applying either to the left or right of the consequence relation, and to restricted classe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004